#include <iostream>
#include <string>
#include <cmath>
using namespace std;

#define maxSize 30000
typedef struct WL
{
    int win[maxSize];
    int lose[maxSize];
    int tags;
} WL;
WL a, b;

string input;
bool flag = false;
int main()
{
    a.tags = 1;
    b.tags = 1;
    while (cin >> input)
    {
        for (int i = 0; i <= input.size(); i++)
        {
            if (input[i] == 'E')
            {
                flag = true;
                break;
            }
            if (input[i] == 'W')
            {
                a.win[a.tags]++;
                b.win[b.tags]++;
            }
            if (input[i] == 'L')
            {
                a.lose[a.tags]++;
                b.lose[b.tags]++;
            }
            //cout << a.win[a.tags] << " " << a.lose[a.tags] << " " << endl;
            if ((a.win[a.tags] >= 11 || a.lose[a.tags] >= 11) && (abs(a.win[a.tags] - a.lose[a.tags]) >= 2))
                a.tags++;
            if ((b.win[b.tags] >= 21 || b.lose[b.tags] >= 21) && (abs(b.win[b.tags] - b.lose[b.tags]) >= 2))
                b.tags++;
            //cout << " /" << a.tags << " :" << b.tags << " " << endl;
            //input.clear();
        }
        if (flag)
            break;
    }
    for (int i = 1; i <= a.tags; i++)
        cout << a.win[i] << ":" << a.lose[i] << endl;
    cout << endl;
    for (int i = 1; i <= b.tags; i++)
        cout << b.win[i] << ":" << b.lose[i] << endl;
    return 0;
}